翻訳と辞書 Words near each other ・ BiCon (UK) ・ Bicon Dental Implants ・ Biconcave disc ・ Bicondica ・ Biconditional elimination ・ Biconditional introduction ・ Bicone ・ Biconic cusp ・ Biconical antenna ・ Biconiosporella ・ Biconjugate gradient method ・ Biconjugate gradient stabilized method ・ Biconnected component ・ Biconnected graph ・ Biconvex ・ Biconvex optimization ・ Bicorn ・ Bicorn (monster) ・ Bicorne ・ Bicornin ・ Bicornis ・ Bicornis (genus) ・ Bicornuate uterus ・ Bicorp ・ Bicosoecid ・ Bicqueley ・ Bicqueley Airdrome ・ Bicrouania ・ BICS ・ Bicsa Financial Center Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Biconvex optimization ： ウィキペディア英語版 Biconvex optimization Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods that can find the global optimum of these problems. A set $B\; \backslash subset\; X\backslash times\; Y$ is called a biconvex set on $X\backslash times\; Y$ if for every fixed $y\backslash in\; Y$, $B\_y\; =\; \backslash$ is a convex set in $X$ and for every fixed $x\backslash in\; X$, $B\_x\; =\; \backslash$ is a convex set in $Y$. A function $f(x,\; y):\; B\; \backslash to\; \backslash mathbb$ is called a biconvex function if fixing $x$, $f\_x(y)\; =\; f(x,\; y)$ is convex over $Y$ and fixing $y$, $f\_y(x)\; =\; f(x,\; y)$ is convex over $X$. A common practice for solving a biconvex problem (which does not guarantee global optimality of the solution) is alternatively updating $x,\; y$ by fixing one of them and solving the corresponding convex optimization problem.〔 == References == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Biconvex optimization」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.